Algebraic approach to single-pushout graph transformation
نویسندگان
چکیده
منابع مشابه
Algebraic Approach to Single-Pushout Graph Transformation
The single-pushout approach to graph transformation interprets a double-pushout transformation rule of the classical algebraic approach which consists of two rotul graph morphisms as a single particll morphism from the left-to the right-hand side. The notion of a double-pushout diagram for the transformation process can then be substituted by a single-pushout diagram in an appropriate category ...
متن کاملPolymorphic Single-Pushout Graph Transformation
Impressum Forschungsberichte der FHDW Hannover – Veröffentlichungen aus dem Bereich Forschung und Entwicklung der FHDW Hannover. Abstract. The paper extends single-pushout graph transformation by poly-morphism, a key concept in object-oriented design. The notions sub-rule and remainder, well-known in single-pushout rewriting, are applied to model dynamic rule extension and type dependent rule a...
متن کاملAlgebraic Transformation of Unary Partial Algebras II: Single-Pushout Approach
The single-pushout approach to graph transformation is extended to the algebraic transformation of partial many-sorted unary algebras. The main result presented in this article is an algebraic characterization of the single-pushout transformation in the categories of all conformisms, all closed quomorphisms, and all closed-domain closed quomorphisms of unary partial algebras over a given signat...
متن کاملAlgebraic Graph Rewriting Using a Single Pushout
We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.
متن کاملA Cloning Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L,R, τ, σ) such that L and R are termgraphs representing the left-hand and the right-hand sides of the rule, τ is a mapping from the nodes of L to those of R and σ is a partial function from nodes of R to nodes of L. τ describes how incident edges of the nodes in L are co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90068-5